/*
 * @lc app=leetcode.cn id=42 lang=java
 *
 * [42] 接雨水
 */

// @lc code=start
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Set;

class Solution {
    public int trap(int[] height) {
        int result = 0;
        Arrays.sort(height);
        Set<Integer> set = new LinkedHashSet<>();
        for (int h : height) {
            set.add(h);
        }
        
        for (int i = 0; i < height.length; i++) {
            
        }
        return result;
    }
}
// @lc code=end
